An Efficient Blind Detection Algorithm of Median Filtered Image
نویسندگان
چکیده
منابع مشابه
An Efficient Blind Detection Algorithm of Median Filtered Image
Due to the significant advances of digital photography and the availability of many powerful photo editing tools, it becomes easier to create forgery images by non-professional users. Median filtering that is usually applied to erase the forensically significant fingerprints has recently received increased attention. In this paper, we present an effective blind forensic algorithm to detect the ...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملAn Efficient Neural Network Algorithm for the p-Median Problem
In this paper we present a neural network model and new formulation for the p-median problem. The effectiveness and efficiency of our algorithm under varying problem sizes are analyzed in comparison to conventional heuristic methods. The results for small-scale problems (less than 100 points) indicate that our implementation of algorithm is effective. Furthermore, we also have applied our algor...
متن کاملAn Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with high probability, a very close estimate of the true median. The running time is linear in the length n of the input. The algorithm performs fewer than 4 3 n comparisons and 1 3 n exchanges on the average. We present an...
متن کاملAn Efficient Local Search Algorithm for k-Median Problem
The k-median problem is one of the NP-hard combinatorial optimization problems. It falls into the general class of clustering problem and has application in the field of classification and data mining. One has confirmed that local search technique is the most effective and simplest method for designing the algorithms for k-median problem, and has been looking for the more efficient algorithms w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Information Technology
سال: 2015
ISSN: 1738-9968
DOI: 10.14257/ijhit.2015.8.1.16